Strengthened teaching–learning-based optimization algorithm for numerical optimization tasks

نویسندگان

چکیده

The teaching–learning-based optimization algorithm (TLBO) is an efficient optimizer. However, it has several shortcomings such as premature convergence and stagnation at local optima. In this paper, the strengthened (STLBO) proposed to enhance basic TLBO’s exploration exploitation properties by introducing three strengthening mechanisms: linear increasing teaching factor, elite system composed of new teacher class leader, Cauchy mutation. Subsequently, seven variants STLBO are designed based on combined deployment improved mechanisms. Performance novel STLBOs evaluated implementing them thirteen numerical tasks, including unimodal tasks (f1–f7) six multimodal (f8–f13). results show that STLBO7 top list, significantly better than original TLBO. Moreover, remaining also outperform Finally, a set comparisons implemented between other advanced techniques, HS, PSO, MFO, GA HHO. curves prove clearly outperforms competitors, stronger optimal avoidance, faster speed higher solution accuracy. All above manifests search performance Data Availability Statements: data generated or analyzed during study included in published article (and its supplementary information files).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spider Monkey Optimization algorithm for numerical optimization

Swarm intelligence is a fascinating area for the researchers in the field of optimization. Researchers have developed many algorithms by simulating the swarming behavior of various creatures like ants, honey bees, fishes, birds and their findings are very motivating. In this paper, a new approach for optimization is proposed by modeling the social behavior of spider monkeys. Spider monkeys have...

متن کامل

Chaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks

Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...

متن کامل

Firefly Algorithm for Continuous Constrained Optimization Tasks

The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The first part of the paper is devoted to the detailed description of the existing algorithm. Then some suggestions for extending the si...

متن کامل

Orthogonal chemical reaction optimization algorithm for global numerical optimization problems

Chemical reaction optimization (CRO) is a newly proposed, easy to implement metaheuristic inspired by the phenomena between molecules in chemical reactions. However, CRO behaves like a random search to traverse the whole solution space, which could confine the algorithm’s search ability. The orthogonal experimental design (OED) method is a robust-design method that can obtain the best combinati...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Evolutionary Intelligence

سال: 2023

ISSN: ['1864-5909', '1864-5917']

DOI: https://doi.org/10.1007/s12065-023-00839-x